Schützenberger Products in a Category
نویسندگان
چکیده
The Schützenberger product of monoids is a key tool for the algebraic treatment of language concatenation. In this paper we generalize the Schützenberger product to the level of monoids in an algebraic category D , leading to a uniform view of the corresponding constructions for monoids (Schützenberger), ordered monoids (Pin), idempotent semirings (Klíma and Polák) and algebras over a field (Reutenauer). In addition, assuming that D is part of a Stone-type duality, we derive a characterization of the languages recognized by Schützenberger products.
منابع مشابه
Regularity of monoids under Schützenberger products
In this paper we give a partial answer to the problem which is about the regularity of Schützenberger products in semigroups asked by Gallagher in his thesis [3, Problem 6.1.6] and, also, we investigate the regularity for the new version of the Schützenberger product which was defined in [1].
متن کاملOn Finite Generation and Presentability of Schützenberger Products
The finite generation and presentation of Schützenberger products of semigroups are investigated. A general necessary and sufficient condition is established for finite generation. The Schützenberger product of two groups is finitely presented as an inverse semigroup if and only if the groups are finitely presented, but is not finitely presented as a semigroup unless both groups are finite. 200...
متن کاملProperties of products for flatness in the category of $S$-posets
This paper is devoted to the study of products of classes of right $S$-posets possessing one of the flatness properties and preservation of such properties under products. Specifically, we characterize a pomonoid $S$ over which its nonempty products as right $S$-posets satisfy some known flatness properties. Generalizing this results, we investigate products of right $S$-posets satisfying Condi...
متن کاملExponential Genus Problems in One–relator Products of Groups
Exponential equations in free groups were studied initially by Lyndon and Schützenberger [26] and then by Comerford and Edmunds [5]. Comerford and Edmunds showed that the problem of determining whether or not the class of quadratic exponential equations have solution is decidable, in finitely generated free groups. In this paper we show that for finite systems of quadratic exponential equations...
متن کاملOn the decidability of the word problem for amalgamated free products of inverse semigroups
We study inverse semigroup amalgams [S1, S2;U ], where S1 and S2 are finitely presented inverse semigroups with decidable word problem and U is an inverse semigroup with decidable membership problem in S1 and S2. We use a modified version of Bennett’s work on the structure of Schützenberger graphs of the R-classes of S1 ∗U S2 to state sufficient conditions for the amalgamated free products S1 ∗...
متن کامل